Parallel Volume Rendering with Sparse Data Structures

نویسندگان

  • Jenshiuh Liu
  • Chih-Hsien Huang
  • Don-Lin Yang
چکیده

Direct volume rendering is a popular technique for scientifc visualization. The computation cost of direct volume rendering increases exponentially as the size of the volume dataset increases. Hence, efficient volume rendering has become an important issue. In this work, we study parallel volume rendering algorithms based on sparse data structures. In order to exploit object space coherence, we propose to employ two sparse-matrix representation schemes as spatial data structures. To further reduce the processing time, we employ data-parallel volume rendering algorithms based on sparse data structures. Two distinct features of our work are: (a) the sparse data structures enable us to reduce the processing time as well as the memory storage requirement; and (b) parallel processing allows us to further speed up the volume rendering process. Experiments were conducted to assess our proposed scheme. Results show that our proposed data parallel algorithms performed well on two different parallel distributed memory systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive Volume Illustration

In this paper we describe non-photorealistic rendering techniques for volumetric data sets. First, we outline an automatic approach that generates line drawings to illustrate such data sets and to augment traditional volume rendering techniques. For a number of seed points that are placed appropriately to represent selected volume structures curvature lines are traced and encoded by a sparse se...

متن کامل

A Parallel Splatting Algorithm With Occlusion Culling

Splatting is a volume rendering technique that projects and accumulates voxels onto the screen. It is able to incorporate a variety of reconstruction kernels without extra computational overhead, as well as reduce computational and storage costs using a sparse volume representation. Previous splatting algorithms suffered from artifacts because they incorrectly separate volume reconstruction and...

متن کامل

An Effective Load Balancing Scheme for 3D Texture-Based Sort-Last Parallel Volume Rendering on GPU Clusters

We present an adaptive dynamic load balancing scheme for 3D texture based sort-last parallel volume rendering on a PC cluster equipped with GPUs. Our scheme exploits not only task parallelism but also data parallelism during rendering by combining the hierarchical data structures (octree and parallel BSP tree) in order to skip empty regions and distribute proper workloads to rendering nodes. Ou...

متن کامل

Adaptive and Scalable Load Balancing Scheme for Sort-Last Parallel Volume Rendering on GPU Clusters

Sort-last parallel rendering using a cluster of GPUs has been widely used as an efficient method for visualizing large-scale volume datasets. The performance of this method is constrained by load balancing when data parallelism is included. In previous works static partitioning could lead to self-balance when only task level parallelism is included. In this paper, we present a load balancing sc...

متن کامل

Fast Volume Rendering of Sparse Datasets Using Adaptive Mesh Refinement

In this paper we present an algorithm that accelerates 3D texturebased volume rendering of large and sparse data sets. A hierarchical data structure (known as AMR tree) consisting of nested uniform grids is employed in order to efficiently encode regions of interest. The hierarchies resulting from this kind of space partitioning yield a good balance between the amount of volume to render and th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002